Diclib.com
Dictionnaire ChatGPT

Recherche dans le dictionnaire Solutions personnalisées

Entrez un mot ou une phrase dans n'importe quelle langue 👆

Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

comment le mot est utilisé
fréquence d'utilisation
il est utilisé plus souvent dans le discours oral ou écrit
options de traduction de mots
exemples d'utilisation (plusieurs phrases avec traduction)
étymologie

Qu'est-ce (qui) est fundamental subsequence - définition

ALGORITHM TO FIND THE LONGEST INCREASING SUBSEQUENCE IN AN ARRAY OF NUMBERS

Longest increasing subsequence problem; Nondecreasing subsequence; Longest nondecreasing subsequence

fundamental

WIKIMEDIA DISAMBIGUATION PAGE

Fundamtenal; Fundamentals; Fundamental (album); Fundament; Fundamental (disambiguation)

I. a.

Essential, primary, indispensable, radical, constitutional, organic, most important, principal.

II. n.

Leading principle, essential part, essential principle.

Subsequency

BINARY RELATION BETWEEN SEQUENCES (STRINGS)

Sub-sequence; Subsequency; Subsequences; Common subsequence

·noun The act or state of following;

- opposed to precedence.

subsequence

BINARY RELATION BETWEEN SEQUENCES (STRINGS)

Sub-sequence; Subsequency; Subsequences; Common subsequence

subsequence¹ ['s?bs?kw(?)ns]

¦ noun formal the state of following or being a consequence of something.

--------

subsequence² ['s?b?si:kw(?)ns]

¦ noun a sequence contained in or derived from another sequence.

Wikipédia

Longest increasing subsequence

In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique. Longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics. The longest increasing subsequence problem is solvable in time $O(n\log n),$ where $n$ denotes the length of the input sequence.

https://en.wikipedia.org/wiki/Longest increasing subsequence